Optimizing Multi-Ciopy Routing Schemes for Resource Constrained Intermittently Connected Mobile Networks

نویسندگان

  • Apoorva Jindal
  • Konstantinos Psounis
چکیده

Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from a source to a destination. Researchers have proposed flooding based schemes for routing in such networks. While flooding based schemes are robust and have a high probability of delivery, they suffer from a huge overhead in terms of bandwidth, buffer space and energy dissipation due to large number of transmissions per packet. So flooding based schemes are impractical for resource constrained networks. Controlled replication or spraying methods can reduce this overhead by distributing a small, fixed number of copies to only a few relays, which then independently route each copy towards the destination. These schemes demonstrate a good delay performance without using a lot of resources. There are three important questions in the context of the design of these spraying based schemes: (i) How many copies per packet should be distributed? (ii) How to distribute these copies amongst the potential relays? (iii) How are each of these copies routed towards the destination? The first and the third questions have been studied in detail by different researchers. But, there has been no study which looks at the second question. This paper fills this void. Specifically, we propose a methodology to derive the optimal spraying policy. As a case study, we find the optimal spraying policy for two different spraying based schemes. Finally, we study the optimal policies to infer simple heuristics which achieve expected delays very close to the optimal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Multi-Copy Routing for Intermittently Connected Mobile Ad Hoc Networks

Intermittently Connected Mobile Ad Hoc Networks (ICMANs) are mobile networks in which complete source-todestination paths do not exist most of the time because of their sparse topology. Such networks enable communications among sparsely distributed moving objects, e.g. a network of ambulances. Traditional routing schemes are unsuitable in ICMANs because they only forward packets in connected pa...

متن کامل

Icmn: Efficient Routing Using Spray Mechanisms

while routing is being carried out from source to destination, at times there might not be the path between source and destination. These networks are called intermittent networks. These occasions will occur mostly in mobile networks which are called intermittently Connected Mobile Networks(ICMN).Intermittently connected mobile networks are wireless networks where most of the time there does no...

متن کامل

Peer to Peer Mechanism in ICMAN’s using Spray and Wait Routing Algorithm

Mobile ad-hoc networks (MANETs) and peer-to-peer (P2P) systems are ubiquitously emerging technologies which share a common underlying decentralized networking paradigm. Deploying Peer to Peer architecture over Mobile ad hoc networks results in an efficient content distribution network. However most of the time MANETs are intermittently connected (No complete path exists from source to destinati...

متن کامل

Multiple-copy Routing in Intermittently Connected Mobile Networks

Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that fall into this paradigm, for example, wildlife tracking sensor networks, military networks, inter-planetary networks, etc. In this context, conventional routing schemes would fail. To deal with such netwo...

متن کامل

Efficient Packet Routing in Highly Mobile Wireless Networks

Traditional mobile ad-hoc network (MANET) and delay tolerant network (DTN) routing schemes work properly only under the limited assumptions. MANET routing schemes are designed for densely populated networks while DTN routing schemes were developed for dealing with intermittently connected topologies. However, in a real environment, the assumption cannot be hold: the density of nodes constantly ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007